In section I the notions of logical and inductive probability will be discussed as well as two explicanda, viz. degree of confirmation, the base for inductive probability, and degree of evidential support, Popper's favourite explicandum. In section II it will be argued that Popper's paradox of ideal evidence is no paradox at all; however, it will also be shown that Popper's way out has its own merits.

GEORGE BOOLE died one hundred years ago. This essay from Cork is intended as commemorative of a great man, for too long forgotten in the College he served so well.

In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial orders (\nsbcdt\ for short). (...) It combines features of the classical tableau method for first-order logic with those of explicit tableau methods for modal logics with constraint label management, and it can be easily tailored to most propositional interval temporal logics proposed in the literature. We prove its soundness and completeness, and we show how it has been implemented. (shrink)

This paper uses an "admissible set semantics" to treat quantification in quantified modal logics. The truth condition for the universal quantifier states that a universally quantified statement (x)A(x) is true at a world w if and only if there is some proposition true at that world that entails every instance of A(x). It is shown that, for any canonical propositional modal logic the corresponding admissible set semantics characterises the quantified version of that modal logic.

Recently, Brass and Dix showed 143–165) that the well founded semantics WFS can be defined as a confluent calculus of transformation rules. This led not only to a simple extension to disjunctive programs 167–213), but also to a new computation of the well-founded semantics which is linear for a broad class of programs. We take this approach as a starting point and generalize it considerably by developing a general theory of Confluent LP-systems CS . Such a system CS is (...) a rewriting system on the set of all logic programs over a fixed signature L and it induces in a natural way a canonical semantics. Moreover, we show four important applications of this theory: most of the well-known semantics are induced by confluent LP-systems , there are many more transformation rules that lead to confluent LP-systems , semantics induced by such systems can be used to model aggregation , the new systems can be used to construct interesting counterexamples to some conjectures about the space of well-behaved semantics. (shrink)

We develop a general theory of FDE-based modal logics. Our framework takes into account the four-valued nature of FDE by considering four partially defined modal operators corresponding to conditions for verifying and falsifying modal necessity and possibility operators. The theory comes with a uniform characterization for all obtained systems in terms of FDE-style formula-formula sequents. We also develop some correspondence theory and show how Hilbert-style axiom systems can be obtained in appropriate cases. Finally, we outline how different systems from (...) the literature can be expressed in our framework. (shrink)

. In this paper, the significance of using general logic-systems and finite consequence operators defined on non-organized languages is discussed. Results are established that show how properties of finite consequence operators are independent from language organization and that, in some cases, they depend only upon one simple language characteristic. For example, it is shown that there are infinitely many finite consequence operators defined on any non-organized infinite language L that cannot be generated from any finite logic-system. On (...) the other hand, it is shown that for any nonempty language L, a set map is a finite consequence operator if and only if it is defined by a general logic-system. Simple logic-system examples that determine specific consequence operator properties are given. (shrink)

As is well known, the variable-sharing property (vsp) is, according to Anderson and Belnap, a necessary property of any relevant logic. In this paper, we shall consider two versions of the vsp, what we label the "weak vsp" (wvsp) and the "strong vsp" (svsp). In addition, the "no loose pieces property," a property related to the wvsp and the svsp, will be defined. Each one of these properties shall generally be characterized by means of a class of logical matrices. (...) In this way, any logic verified by an actual matrix in one of these classes has the property the class generally represents. Particular matrices (and so, logics) in each class are provided. (shrink)

A general framework for translating various logical systems is presented, including a set of partial unary operators of affirmation and negation. Despite its usual reading, affirmation is not redundant in any domain of values and whenever it does not behave like a full mapping. After depicting the process of partial functions, a number of logics are translated through a variety of affirmations and a unique pair of negations. This relies upon two preconditions: a deconstruction of truth-values as ordered and (...) structured objects, unlike its mainstream presentation as a simple object; a redefinition of the Principle of Bivalence as a set of four independent properties, such that its definition does not equate with normality. (shrink)

The question motivating my investigation is: Are the basic philosophical principles underlying the "core" system of contemporary logic exhausted by the standard version? In particular, is the accepted narrow construal of the notion "logical term" justified? ;As a point of comparison I refer to systems of 1st-order logic with generalized quantifiers developed by mathematicians and linguists . Based on an analysis of the Tarskian conception of the role of logic I show that the standard division of terms (...) into logical and extra-logical is partly arbitrary. I argue that the semantic principles of Tarskian logic allow any higher order mathematical predicate or relation to function as a logical term in a 1st-order system, provided it is introduced in the right way into the syntactic-semantic apparatus. ;Formally, I propose a new, "constructive", semantic characterization of logical terms. A logical term is defined by a function which, given a model, "shows" how to construct relations, sets, or n-tuples of individuals which satisfy it. I discuss the linguistic applicability of the extended logic and bring numerous examples. ;One chapter is devoted to branching quantification--a non-standard logico-linguistic construction obtained by affixing a non-linear, partially-ordered quantifier-prefix to a well-formed formula. Although standard branching quantifiers were given a complete account by Henkin and Walkoe, it is not altogether clear what the meaning of branching generalized quantifiers is. I propose a new analysis of the generalized branching prefix which extends the existent, partial, definitions due to Barwise, and I develop a generalization leading to a "family" of branching structures. ;In conclusion I discuss the philosophical impact of the generalized conception of logic on such issues as the logicist thesis, the interaction between mathematics and logic, ontological commitment via logic, metaphysics and logical semantics. (shrink)

Dzhaparidze, G., A generalized notion of weak interpretability and the corresponding modal logic, Annals of Pure and Applied Logic 61 113-160. A tree Tr of theories T1,...,Tn is called tolerant, if there are consistent extensions T+1,...,T+n of T1,...,Tn, where each T+i interprets its successors in the tree Tr. We consider a propositional language with the following modal formation rule: if Tr is a tree of formulas, then Tr is a formula, and axiomatically define in this language the decidable (...) logics TLR and TLRω. It is proved that TLR yields exactly the schemata of PA-provable sentences, if Tr is understood as “Tr is tolerant”. In fact, TLR axiomatizes a considerable fragment of provability logic with quantifiers over ∑1-sentences, and many relations that have been studied in the literature can be expressed in terms of tolerance. We introduce and study two more relations between theories: cointerpretability and cotolerance which are, in a sense, dual to interpretability and tolerance. Cointerpretability is a characterization of ∑1-conservativity for essentially reflexive theories in terms of translations. (shrink)

In this paper we introduce hypersequent-based frameworks for the modelling of defeasible reasoning by means of logic-based argumentation and the induced entailment relations. These structures are an extension of sequent-based argumentation frameworks, in which arguments and the attack relations among them are expressed not only by Gentzen-style sequents, but by more general expressions, called hypersequents. This generalization allows us to overcome some of the known weaknesses of logical argumentation frameworks and to prove several desirable properties of the entailments (...) that are induced by the extended frameworks. It also allows us to incorporate as the deductive base of our formalism some well-known logics, which lack cut-free sequent calculi, and so are not adequate for standard sequent-based argumentation. We show that hypersequent-based argumentation yields robust defeasible variants of these logics, with many desirable properties. (shrink)

In Belegradek et al. 85) the collapse result theorem was proved for locally generic queries over ordered domain with pseudo-finite homogeneity property. In a very interesting paper of Baldwin and Benedikt the collapse result theorem was proved for locally generic queries over ordered domains without the independence property. It means that over such a domain, order-generic extended queries fail to express more than restricted queries. It was observed by Baldwin and Benedikt that any theory without the independence property is P-reducible. (...) I prove that, for the P-reducible theories, a version of pseudo-finite homogeneity property holds. (shrink)

In the chapter on quantum logic in Volume 6 of Handbook of Philosophical Logic, Dalla Chiara and Giuntini make an interesting observation that there is a unified relational semantics underlying both the {¬,∧}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{ {\lnot }, {\wedge } \}$$\end{document}-fragment of intuitionistic logic and ortho-logic. In this paper, we contribute to a systematic investigation of this relational semantics by providing an axiomatization of its logic.

The Bounds of Logic presents a new philosophical theory of the scope and nature of logic based on critical analysis of the principles underlying modern Tarskian logic and inspired by mathematical and linguistic development. Extracting central philosophical ideas from Tarski’s early work in semantics, Sher questions whether these are fully realized by the standard first-order system. The answer lays the foundation for a new, broader conception of logic. By generally characterizing logical terms, Sher establishes a fundamental (...) result in semantics. Her development of the notion of logicality for quantifiers and her work on branching are of great importance for linguistics. Sher outlines the boundaries of the new logic and points out some of the philosophical ramifications of the new view of logic for such issues as the logicist thesis, ontological commitment, the role of mathematics in logic, and the metaphysical underpinning of logic. She proposes a constructive definition of logical terms, reexamines and extends the notion of branching quantification, and discusses various linguistic issues and applications. (shrink)

Designing a data-responsive system requires accurate input to ensure efficient results. The growth of technology in sensing methods and the needs of various kinds of data greatly impact data fusion (DF)-related study. A coordinative DF framework entails the participation of many subsystems or modules to produce coordinative features. These features are utilized to facilitate and improve solving certain domain problems. Consequently, this paper proposes a general Multiple Coordinative Data Fusion Modules (MCDFM) framework for real-time and heterogeneous data sources. We (...) develop the MCDFM framework to adapt various DF application domains requiring macro and micro perspectives of the observed problems. This framework consists of preprocessing, filtering, and decision as key DF processing phases. These three phases integrate specific purpose algorithms or methods such as data cleaning and windowing methods for preprocessing, extended Kalman filter (EKF) for filtering, fuzzy logic for local decision, and software agents for coordinative decision. These methods perform tasks that assist in achieving local and coordinative decisions for each node in the network of the framework application domain. We illustrate and discuss the proposed framework in detail by taking a stretch of road intersections controlled by a traffic light controller (TLC) as a case study. The case study provides a clearer view of the way the proposed framework solves traffic congestion as a domain problem. We identify the traffic features that include the average vehicle count, average vehicle speed (km/h), average density (%), interval (s), and timestamp. The framework uses these features to identify three congestion periods, which are the nonpeak period with a congestion degree of 0.178 and a variance of 0.061, a medium peak period with a congestion degree of 0.588 and a variance of 0.0593, and a peak period with a congestion degree of 0.796 and a variance of 0.0296. The results of the TLC case study show that the framework provides various capabilities and flexibility features of both micro and macro views of the scenarios being observed and clearly presents viable solutions. (shrink)

The main goal of this paper is to provide a ground-analysis of two classical connectives that have so far been ignored in the literature, namely the exclusive disjunction, and the ternary disjunction. Such ground-analysis not only serves to extend the applicability of the logic of grounding but also leads to a generalization of Poggiolesi (2016)’s definition of the notion of complete and immediate grounding.

We propose a general framework for dynamic epistemic logics. It consists of a generic language for DELs and a class of structures, called model transition systems, that describe model transformations in a static way. An MTS can be viewed as a two-layered Kripke model and consequently inherits standard concepts such as bisimulation and bounded morphism from the ordinary Kripke models. In the second half of this article we add the global operator to the language, which enables us to define (...) the notions of a canonical MTS and canonicity of a DEL formula for a property of MTSs. Using these notions, we clarify correspondences between axioms of DELs and properties of MTSs. (shrink)

There are several known Lindström-style characterization results for basic modal logic. This paper proves a generic Lindström theorem that covers any normal modal logic corresponding to a class of Kripke frames definable by a set of formulas called strict universal Horn formulas. The result is a generalization of a recent characterization of modal logic with the global modality. A negative result is also proved in an appendix showing that the result cannot be strengthened to cover every first-order (...) elementary class of frames. This is shown by constructing an explicit counterexample. (shrink)

Classical logic assumes that names are univocal: Every name refers to exactly one existing individual. This Principle of Univocality has two parts: an existence assumption and a uniqueness assumption. The existence assumption holds that every name refers to at least one individual, and the uniqueness assumption states that every name refers to at most one individual. Various systems of free logic which have been developed and studied since the 1960s relax the existence assumption, but retain the uniqueness assumption. (...) The present work investigates violations of both halves of the Principle of Univocality. That is, whereas the free logics developed from the 1960s are called 'free' because they are free of existential assumptions, the current Element generalizes this idea, to study logics that are free of uniqueness assumptions. It explores several versions of free logic, comparing their advantages and disadvantages. Applications of free logic to other areas of philosophy are explored. (shrink)

A propositional logic of explicit proofs, LP, was introduced in [S. Artemov, Explicit provability and constructive semantics, The Bulletin for Symbolic Logic 7 1–36], completing a project begun long ago by Gödel, [K. Gödel, Vortrag bei Zilsel, translated as Lecture at Zilsel’s in: S. Feferman , Kurt Gödel Collected Works III, 1938, pp. 62–113]. In fact, LP can be looked at in a more general way, as a logic of explicit evidence, and there have been several (...) papers along these lines. A major result about LP is the Realization Theorem, that says any theorem of S4 can be converted into a theorem of LP by some replacement of necessitation symbols with explicit proof terms. Thus the necessitation operator of S4 can be seen as a kind of implicit existential quantifier: there exists a proof term such that…. In this paper, quantification over evidence is introduced into LP, and it is shown that the connection between S4 necessitation and the existential quantifier becomes an explicit one. The extension of LP with quantifiers is called QLP. A semantics and an axiom system for QLP are given, soundness and completeness are established, and several results are proved relating QLP to LP and to S4. (shrink)

In "An Alternative Semantics for Quantified Relevant Logic" (JSL 71 (2006)) we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complete semantics to the quantified extensions, both with and without the Barcan formula, of every proposi- tional modal logic S. If S is canonical our models are based on propositional frames that validate S. We employ frames in which (...) not every set of worlds is an admissible proposition, and an alternative interpretation of the uni- versal quantifier using greatest lower bounds in the lattice of admissible propositions. Our models have a fixed domain of individuals, even in the absence of the Barcan formula. For systems with the Barcan formula it is possible to preserve the usual Tarskian reading of the quantifier, at the expensive of sometimes losing va- lidity of S in the underlying propositional frames. We apply our results to a number of logics, including S4.2, S4M and KW, whose quantified extensions are incomplete for the standard semantics. (shrink)

Aim of the paper is to present a new logic of technical malfunction. The need for this logic is motivated by a simple-sounding philosophical question: Is a malfunctioning corkscrew, which fails to uncork bottles, nonetheless a corkscrew? Or in general terms, is a malfunctioning F, which fails to do what Fs do, nonetheless an F? We argue that ‘malfunctioning’ denotes the modifier Malfunctioning rather than a property, and that the answer depends on whether Malfunctioning is subsective or (...) privative. If subsective, a malfunctioning F is an F; if privative, a malfunctioning F is not an F. An intensional logic is required to raise and answer the question, because modifiers operate directly on properties and not on sets or individuals. This new logic provides the formal tools to reason about technical malfunction by means of a logical analysis of the sentence “a is a malfunctioning F”. (shrink)

This paper introduces a generalized version of inquisitive semantics, denoted as GIS, and concentrates especially on the role of disjunction in this general framework. Two alternative semantic conditions for disjunction are compared: the first one corresponds to the so-called tensor operator of dependence logic, and the second one is the standard condition for inquisitive disjunction. It is shown that GIS is intimately related to intuitionistic logic and its Kripke semantics. Using this framework, it is shown that the (...) main results concerning inquisitive semantics, especially the axiomatization of inquisitive logic, can be viewed as particular cases of more general phenomena. In this connection, a class of non-standard superintuitionistic logics is introduced and studied. These logics share many interesting features with inquisitive logic, which is the strongest logic of this class. (shrink)

"The role of logic in the Middle Ages. Regarding the role of logic within the framework of arts and sciences during the Middle Ages, we have to distinguish two related aspects, one institutional and the other scientific. As to the first aspect, we have to remember that the medieval educational system was based on the seven liberal arts, which were divided into the trivium, i.e., three arts of language, and the quadrivium, i.e., four mathematical arts. The so-called trivial (...) arts were grammar, rhetoric, and logic, and during a period of several centuries virtually every educated person, at least every university graduate, received a training in these matters, especially in logic. Students in the medieval faculty of arts probably spent more time studying logic than any other discipline. This first -- institutional -- aspect concerning the role of logic is explained by the second -- scientific -- aspect. The trivial disciplines provided techniques of analysis and a technical vocabulary that permeate philosophical, scientific and theological writings. Logic, as mentioned before, was referred to and was generally regarded as the art of arts and the science of sciences. The increasing cultural dominance of the universities with their obligatory disputationes and their hierarchy of examinations on the one hand and the outstanding status of logic on the other were corresponding features of the educational world of the 13th century. The core of the logic curriculum from the 12th century onwards was provided by the logical works of Aristotle. These represented the material for the study of types of predication, the analysis of simple propositions or statements (2) and their relations of inference and equivalence, the analysis of modal propositions, of the structure and the types of the syllogism, dialectical topics, fallacies and scientific reasoning as based on the demonstrative syllogism. Medieval logicians, however, realized that there were other, non-Aristotelian, approaches to logical subjects, questions and methods that could be investigated.. (shrink)

Intensional logic is the technical study of such intensional phenomena in human reasoning as modality, knowledge, or flow of time. These all require a richer semantic picture than standard truth values in one static environment. Such a picture is provided by so-called possible worlds semantics, a paradigm which is surveyed in this book, both as to its external sources of motivation and as to the internal dynamics of the resulting program. In particular, Manual of Intensional Logic presents the (...) major classical topics, including modal logic, tense logic, and conditional logic, all of which illustrate motivations coming from philosophy and linguistics. The Book also discusses recent computational applications in computer science and AI. Finally, Manual of Intensional Logic takes up recent developments in the study of language and information making themselves felt in the area. The Book examines the role of partial information--with illustrations drawn from different branches of Intensional Logic--and various influences stemming from current theories of the semantics of natural language, involving generalized quantifiers and theories of types. (shrink)